Modified Prioritized Deadline based Scheduling Algorithm for Computational Grid
نویسندگان
چکیده
منابع مشابه
Unified Economic Deadline Scheduling Algorithm for Computational Grid
Efficient and dynamic resources scheduling algorithms are needed to harness the hidden power of a Grid System. In this work, a few economic scheduling algorithms have been proposed. First, Grid system is modeled using a vector space approach. Then, a cost function for the operation has been defined. Using the model and cost function defined, a few new economic scheduling algorithms have been pr...
متن کاملDeadline-Based Scheduling Algorithm for Divisible-Load in Grid Computing
The divisible load model is motivated by divisible load theory, where both communication and computation can be arbitrarily divisible into as many independent partitions as required and facilitates a good approximation for many real-world application systems such as those arising in large physics experiments. Scheduling an application with divisible load in data grid is significantly important ...
متن کاملA Security Prioritized Computational Grid Scheduling Model: An Analysis
Grid supports heterogeneities of resources in terms of security and computational power. Applications with stringent security requirement introduce challenging concerns when executed on the grid resources. Though grid scheduler considers the computational heterogeneity while making scheduling decisions, little is done to address their security heterogeneity. This work proposes a security aware ...
متن کاملLocal Search for Deadline Driven Grid Scheduling
This work describes application of local search based algorithms for job scheduling in the Grid environment where dynamic changes occur. The primary intent is to consider problems with the typical quality of service constraint taking into account and minimizing the number of late jobs. To achieve this goal a special instance of the Tabu search algorithm applicable to dynamic problems is propose...
متن کاملStability Assessment Metamorphic Approach (SAMA) for Effective Scheduling based on Fault Tolerance in Computational Grid
Grid Computing allows coordinated and controlled resource sharing and problem solving in multi-institutional, dynamic virtual organizations. Moreover, fault tolerance and task scheduling is an important issue for large scale computational grid because of its unreliable nature of grid resources. Commonly exploited techniques to realize fault tolerance is periodic Checkpointing that periodically ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/15556-4268